import java.util.Scanner;

/*
    走方格
 */
public class WalkGrid {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        sc.close();
        int a[][] = new int[n][m];
        a[0][0] = 1;
        for (int i = 0 ; i < n ; i++){
            for (int j = 0 ; j < m ; j++){

                if (i == 0 && j == 0){
                    continue;
                }

                if (i > 0){
                    a[i][j] += a[i-1][j];
                }

                if (j > 0){
                    a[i][j] += a[i][j-1];
                }

                if ((i&1) == 1 && (j&1)==1){
                    a[i][j] = 0;
                }
            }
        }
        System.out.println(a[n-1][m-1]);
    }
}
